Bounded VC-Dimension Implies a Fractional Helly Theorem
نویسنده
چکیده
We prove that every set system of bounded VC-dimension has a fractional Helly property. More precisely, if the dual shatter function of a set system F is bounded by o(m k), then F has fractional Helly number k. This means that for every > 0 there exists a > 0 such that if F 1 ; F 2 ; : : : ; F n 2 F are sets with T i2I F i 6 = ; for at least ? n k sets I f1; 2; : : :; ng of size k, then there exists a point common to at least n of the F i. This further implies a (p; k)-theorem: for every F as above and every p k there exists T such that if G F is a nite subfamily where among every p sets, some k intersect, then G has a transversal of size T. The assumption about bounded dual shatter function applies, for example, to families of sets in R d deenable by a bounded number of polynomial inequalities of bounded degree; in this case, we obtain fractional Helly number d+1.
منابع مشابه
A fractional Helly theorem for convex lattice sets
A set of the form C-Z ; where CDR is convex and Z denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of d-dimensional convex lattice sets is 2 : We prove that the fractional Helly number is only d þ 1: For every d and every aAð0; 1 there exists b40 such that whenever F1;y;Fn are convex lattice sets in Z such that T iAI Fia| for at least að n dþ1Þ inde...
متن کاملHelly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected topological space Γ. Assume that for every sub-family G ⊆ F the intersection of the elements of G has at most r connected components, each of which is a Q-homology cel...
متن کاملColoring Dense Graphs via Vc-dimension
The Vapnik-Červonenkis dimension is a complexity measure of set-systems, or hypergraphs. Its application to graphs is usually done by considering the sets of neighborhoods of the vertices (see [1] and [5]), hence providing a set-system. But the graph structure is lost in the process. The aim of this paper is to introduce the notion of paired VC-dimension, a generalization of VC-dimension to set...
متن کاملBerge's theorem, fractional Helly, and art galleries
In one of his early papers Claude Berge proved a Helly-type theorem, which replaces the usual “nonempty intersection” condition with a “convex union” condition. Inspired by this we prove a fractional Helly-type result, where we assume that many (d+1)-tuples of a family of convex sets have a star-shaped union, and the conclusion is that many of the sets have a common point. We also investigate s...
متن کاملThe University of Chicago Algorithmic Stability and Ensemble-based Learning a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science by Samuel Kutin
We explore two themes in formal learning theory. We begin with a detailed, general study of the relationship between the generalization error and stability of learning algorithms. We then examine ensemble-based learning from the points of view of stability, decorrelation, and threshold complexity. A central problem of learning theory is bounding generalization error. Most such bounds have been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 31 شماره
صفحات -
تاریخ انتشار 2004